Partial geometric designs having circulant concurrence matrices

نویسندگان

چکیده

We classify small partial geometric designs (PGDs) by spectral characteristics of their concurrence matrices. It is well known that the matrix a PGD can have at most three distinct eigenvalues, all which are nonnegative integers. The contains useful information on incidence structure design. An ordinary 2- ( v , k λ ) $(v,k,\lambda )$ design has single $\lambda $ and its circulant, geometry two concurrences 1 0, transversal TD u ${\text{TD}}_{\lambda }(k,u)$ circulant. In this paper, we survey PGDs highlighting constructions. Then investigate symmetric circulant matrices realized as PGDs. particular, try to give list order up 12 each matrix. then describe these along with combinatorial properties This work part second author's Ph.D. dissertation [46].

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Restricted Isometries for Partial Random Circulant Matrices

In the theory of compressed sensing, restricted isometry analysis has become a standard tool for studying how efficiently a measurement matrix acquires information about sparse and compressible signals. Many recovery algorithms are known to succeed when the restricted isometry constants of the sampling matrix are small. Many potential applications of compressed sensing involve a data-acquisitio...

متن کامل

Partial geometric designs and difference families

We examine the designs produced by different types of difference families. Difference families have long been known to produce designs with well behaved automorphism groups. These designs provide the elegant solutions desired for applications. In this work, we explore the following question: Does every (named) design have a difference family analogue? We answer this question in the affirmative ...

متن کامل

One-bit compressed sensing with partial Gaussian circulant matrices

In this paper we consider memoryless one-bit compressed sensing with randomly subsampled Gaussian circulant matrices. We show that in a small sparsity regime and for small enough accuracy $\delta$, $m\sim \delta^{-4} s\log(N/s\delta)$ measurements suffice to reconstruct the direction of any $s$-sparse vector up to accuracy $\delta$ via an efficient program. We derive this result by proving that...

متن کامل

k-Circulant Supersaturated Designs

A class of supersaturated designs called k-circulant designs is explored. These designs are constructed from cyclic generators by cycling k elements at a time. The class of designs includes many Es2-optimal designs, some of which are already known and some of which are more efŽ cient than known designs for model estimation under factor sparsity. Generators for the most efŽ cient designs are lis...

متن کامل

On circulant and two-circulant weighing matrices

We employ theoretical and computational techniques to construct new weighing matrices constructed from two circulants. In particular, we construct W (148, 144), W (152, 144), W (156, 144) which are listed as open in the second edition of the Handbook of Combinatorial Designs. We also fill a missing entry in Strassler’s table with answer ”YES”, by constructing a circulant weighing matrix of orde...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Designs

سال: 2022

ISSN: ['1520-6610', '1063-8539']

DOI: https://doi.org/10.1002/jcd.21834